Task #M025C

Memory 16 MB Time 1000 ms Complexity 65 %

Baxtli son

\(2N\) xonali sonning dastlabki \(N\) ta raqami yig’indisi keyingi \(N\) ta raqami yig’indisiga teng bo’lsa bu son baxtli son deyiladi. Siz \([L, R]\) oraliqda nechta baxtli son borligini aniqlang.

Input:

Kirish faylining dastlabki satrida bitta butun son, \(T(1 \le T \le 2*10^5)\) testlar soni kiritiladi. Keyingi T ta qatorda ikkitadan butun son, \(L\) va \(R (1 \le L \le R \le 10^9)\) sonlari kiritiladi.

Output:

Chiqish faylida har bir test uchun alohida qatorda masala javobini chop eting.

Examples

#	input.txt	output.txt
1	1 1 100	9

Telegram Facebook

Submit answer

Please, sing in, to complete this action, if you don't have account, you can sign up any moment